A Sudoku-Solver for Large Puzzles using SAT
نویسندگان
چکیده
n × n Sudoku puzzles can be straightforwardly encoded as SAT problems. However, solving such puzzles for large n requires a significant amount of optimization. We present some ideas for reducing the number of clauses, for improving the encoding, and for the selection of suitable SAT solvers.
منابع مشابه
Solving Puzzles ( Eg . Sudoku ) and Other Combinatorial Problems with Sat
There are many combinatorial puzzles around the world. Solving these puzzles is an intellectual challenge to human kinds. In computing, one way of solving these combinatorial puzzles is by modeling them as a satisfiablility problem (SAT). The SAT problem is to find given a propositional logic formula an assignment of the variables which makes the formula true. In this project, we use Sudoku, th...
متن کاملExploring Performance Tradeoffs in a Sudoku SAT Solver
I implemented a SAT solver capable of solving Sudoku puzzles using constraint programming in all three of the languages we’ve discussed in CS242: Lua, Ocaml, and Rust. I analyzed the performance of the same algorithm implemented across the different languages, comparing both average runtime across a set of 50 "easy" Sudoku puzzles and a set of 10 "hard" puzzles. The major concept I explored for...
متن کاملOptimized CNF Encoding for Sudoku Puzzles
A Sudoku puzzle can be regarded as a propositional SAT problem. Various encodings are known for encoding Sudoku as a Conjunctive Normal Form(CNF) formula. Using these encodings for large Sudoku puzzles, however, generates too many clauses, which impede the performance of state-of-the-art SAT solvers. This paper presents an optimized CNF encoding in order to deal with large instances of Sudoku p...
متن کاملSolving and Rating Sudokus using Constraint Satisfiability Approaches and Genetic Algorithms
Sudoku is a very simple and well-known puzzle that has achieved international popularity in the recent past. This project addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques. We introduce two straightforward SAT encodings for Sudoku: the minimal encoding a...
متن کاملSudoku as a SAT Problem
Sudoku is a very simple and well-known puzzle that has achieved international popularity in the recent past. This paper addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques. We introduce two straightforward SAT encodings for Sudoku: the minimal encoding and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010